CHC+RT: Coherent Hierarchical Culling for Ray Tracing

نویسندگان

  • Oliver Mattausch
  • Jirí Bittner
  • Alberto Jaspe Villanueva
  • Enrico Gobbetti
  • Michael Wimmer
  • Renato Pajarola
چکیده

We propose a new technique for in-core and out-of-core GPU ray tracing using a generalization of hierarchical occlusion culling in the style of the CHC++ method. Our method exploits the rasterization pipeline and hardware occlusion queries in order to create coherent batches of work for localized shader-based ray tracing kernels. By combining hierarchies in both ray space and object space, the method is able to share intermediate traversal results among multiple rays. We exploit temporal coherence among similar ray sets between frames and also within the given frame. A suitable management of the current visibility state makes it possible to benefit from occlusion culling for less coherent ray types like diffuse reflections. Since large scenes are still a challenge for modern GPU ray tracers, our method is most useful for scenes with medium to high complexity, especially since our method inherently supports ray tracing highly complex scenes that do not fit in GPU memory. For in-core scenes our method is comparable to CUDA ray tracing and performs up to 5.94× better than pure shader-based ray tracing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ray Tracing Polygons using Spatial Subdivision

Ray tracing [Appe68] [Gold71] is widely acknowledged as a rendering approach that can produce very realistic and beautiful images [Whit80]. It is also widely known that ray tracing is very expensive computationally. Many intersection culling algorithms have been proposed to reduce this expense. However, such intersection culling algorithms do not take into consideration the nature of the primit...

متن کامل

CHC++: Coherent Hierarchical Culling Revisited

We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of temporal and spatial coherence of visibility. This is achieved by using adaptive visibility prediction and query batching. As a result of the new optimizations the number of issued occlusion queries and the number of ren...

متن کامل

Shape Based Culling

This paper describes a technique to improve the rendering time of volumetric datasets using a volumetric skeleton. The skeleton is used to define a hierarchical set of bounding spheres which completely encapsulate the volume, enabling efficient space leaping during the ray casting and ray tracing processes. The spheres can also be used to cull portions of the dataset, i.e. by specifying logical...

متن کامل

Visualizing Particle-Based Simulation Datasets on the Desktop

We present an approach to rendering large, time-varying particle-based simulation datasets using programmable graphics hardware on desktop computer systems. Particle methods are used to model a wide range of complex phenomena, and effective visualization of the resulting data requires communicating subtle changes in the three-dimensional structure, spatial organization, and qualitative trends w...

متن کامل

Ray-Box Culling for Tree Structures

Ray-primitive intersection tests are the most important operations in ray tracing. The ray-box culling algorithm was presented to accelerate these intersection tests on grid structures, but this algorithm has not been widely used due to the poor ray traversal performance of the grid structures themselves. In this paper, we demonstrate how to apply this algorithm to tree structures and investiga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2015